Online Interval Coloring and Variants
نویسندگان
چکیده
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without bandwidth and a new problem called lazy online coloring again with and without bandwidth. We consider both general interval graphs and unit interval graphs. Specifically, we establish the difference between the two main problems which are interval coloring with and without bandwidth. We present the first nontrivial lower bound of 3.2609 for the problem with bandwidth. This improves the lower bound of 3 that follows from the tight results for interval coloring without bandwidth presented in [9].
منابع مشابه
Online Interval Coloring with Packing Constraints
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the vector constraints. We construct competitive algorithms for each of the variants. Additionally, we ...
متن کاملAn improved algorithm for online coloring of intervals with bandwidth
We present an improved online algorithm for coloring interval graphs with bandwidth. This problem has recently been studied byAdamy and Erlebach and a 195-competitive online strategy has been presented. We improve this by presenting a 10-competitive strategy. To achieve this result, we use variants of an optimal online coloring algorithm due to Kierstead and Trotter. © 2006 Elsevier B.V. All ri...
متن کاملA new lower bound for the on-line coloring of intervals with bandwidth
The on-line interval coloring and its variants are important combinatorial problems with many applications in network multiplexing, resource allocation and job scheduling. In this paper we present a new lower bound of 4.1626 for the competitive ratio for the on-line coloring of intervals with bandwidth which improves the best known lower bound of 24 7 . For the on-line coloring of unit interval...
متن کاملA Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring
Kierstead and Trotter (Congressus Numerantium 33, 1981) proved that their algorithm is an optimal online algorithm for the online interval coloring problem. In this paper, for online unit interval coloring, we show that the number of colors used by the Kierstead-Trotter algorithm is at most 3ω(G)− 3, where ω(G) is the size of the maximum clique in a given graph G, and it is the best possible.
متن کاملOnline Coloring Co-interval Graphs
We study the problem of online coloring co-interval graphs. In this problem, a set of intervals on the real line is presented to the online algorithm in some arbitrary order, and the algorithm must assign each interval a color that is different from the colors of all previously presented intervals not intersecting the current interval. It is known that the competitive ratio of the simple First-...
متن کامل